A history of the Tileworld agent testbed
نویسنده
چکیده
This paper looks at the history and development of an agent testbed called Tileworld. It defines the original testbed and documents its gradual development up to its current form. It also introduces some of the experiments performed using Tileworld and their results. It concludes with a comparison of Tileworld with other agent testbeds and a look at agent testbeds as a whole. Tileworld A History Tileworld was initially introduced in [Pollack and Ringuette, 1990] as a system with a highly parameterised environment which could be used to investigate reasoning in agents. The original Tileworld consists of a grid of cells (squares) on which various objects can exist. These objects can be anyone of the following, agents, tiles, obstacles and holes. The agent (about which the experiment is based) can move up, down left or right. The agents objective is to pick up and move tiles so as to fill the holes. A hole has an associated point value which is awarded to the agent upon filling the hole. Each hole varies in size and point value, so a hole may consist of three cells on the grid and have a total point value of five. Once the hole is filled completely the agent gains the points. The agent knows how valuable each hole is in advance; its overall goal is to get as many points as possible.Tileworld simulations are dynamic, the environment changes continually over time. The objects appear and disappear at rates pre-determined by parameters in the simulator. The first use of Tileworld as a testbed was in [Pollack and Ringuette, 1990] in which it was used to test the IRMS architecture [Bratman et al., 1988]. Following the initial experiments in [Pollack and Ringuette, 1990] tileworld was shown to be a viable testbed for evaluating agent architectures. In [Kinny, 1990] Kinny investigates various simulated worlds and sets out four properties an idealised simulated world should have. • A set of objects and events sufficiently rich to embody ”interesting” aspects of real environments
منابع مشابه
Performance of a Multi-agent Simulation on a Distributed Blackboard System
Research into multi-agent systems has increased over several years, leading to demand for multi-agent system simulators to investigate the interaction between different agents and their environment. The more complex and intelligent the agents become, the more difficult it is to simulate them. Distributing the simulation across different processors would improve its performance. This paper descr...
متن کاملCritiquing the Tileworld: Agent Architectures, Planning Benchmarks, and Experimental Methodology
AI Planning for many years was concerned with solving problems in small, controlled domains like the Blocksworld, and testing the algorithms on small, pathological problems like the Sussman anomaly. Lately the eld has taken on two new goals: to apply planning techniques to more realistic worlds, and to nd a better way to validate the research eorts. One solution that is gaining popularity is to...
متن کاملEmotion as an Enabler of Co-operation
Human reasoning and behaviour is undoubtedly influenced by emotions. However, the role of emotion in reasoning has, until recently, been viewed as secondary, with preference given to game theory principles in order to explain how the reasoning of an individual affects sociable interaction and the phenomenon of cooperation. Despite this, development of emotional agent architectures has gained in...
متن کاملEXPERIMENTAL INVESTIGATION OF AN AGENT COMMITMENT STRATEGY x Martha
In dynamic environments, optimal deliberation in the decision-theoretic sense is impossible. Instead, it is sometimes necessary to trade potential decision quality for decision timeliness. One approach to achieving this trade-o is to endow intelligent agents with meta-level strategies that provide them guidance about when to reason| and what to reason about|and when to act instead. In this pape...
متن کاملOn the Problem of Comparing Two Models for Rational Decision Making in Autonomous Agents
The main objective of this work is to establish a basis for comparing BDI agents with the optimality of decision theory models such as POMDPs. It is argued that a direct comparison is not possible due to the intractability of the algorithms used for solving POMDPs, and therefore an approximation must be used. We propose the reduction of the state space, and the combination of sub-solutions as t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002